Approximate algorithms for credal networks with binary variables
نویسندگان
چکیده
منابع مشابه
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All alg...
متن کاملIPE and L2U: Approximate Algorithms for Credal Networks
This paper presents two approximate algorithms for inference in graphical models for binary random variables and imprecise probability. Exact inference in such models is extremely challenging in multiply-connected graphs. We describe and implement two new approximate algorithms. The first one is the Iterated Partial Evaluation (IPE) algorithm, directly based on the Localized Partial Evaluation ...
متن کاملAlgorithms for Approximated Inference with Credal Networks
A credal network associates convex sets of probability distributions with graph-based models. Inference with credal networks aims at determining intervals on probability measures. Here we describe how a branch-and-bound based approach can be applied to accomplish approximated inference in polytrees iteratively. Our strategy explores a breadth-first version of branch-and-bound to compute outer a...
متن کاملBinarization Algorithms for Approximate Updating in Credal Nets
Credal networks generalize Bayesian networks relaxing numerical parameters. This considerably expands expressivity, but makes belief updating a hard task even on polytrees. Nevertheless, if all the variables are binary, polytree-shaped credal networks can be efficiently updated by the 2U algorithm. In this paper we present a binarization algorithm, that makes it possible to approximate an updat...
متن کاملHill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
This paper proposes two new algorithms for inference in credal networks. These algorithms enable probability intervals to be obtained for the states of a given query variable. The first algorithm is approximate and uses the hill-climbing technique in the Shenoy–Shafer architecture to propagate in join trees; the second is exact and is a modification of Rocha and Cozman’s branch-and-bound algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2008
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2007.09.003